New Construction Methods of Secret Sharing Schemes Based on Authorized Subsets

Efficient Secret Sharing Schemes Based on Unauthorized Subsets

We propose efficient secret sharing schemes realizing general access structures. Our proposed schemes are perfect secret sharing schemes and include Shamir’s (k, n)-threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes. key words: (k, n)-threshold scheme, general access structure...

On Construction of Cumulative Secret Sharing Schemes

Secret sharing schemes are one of the most important primi-tives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two diierent methods for constructing cumulative secret sharing schemes. The rst method produces a simple and eecient cumulative scheme. The second method...

On Secret Sharing Schemes

The concept of secret sharing has been introduced independently by Shamir and Blakley, as a tool to protect a secret from getting exposed or from being lost. It allows a so-called dealer to share a secret among the members of a set P , which are usually called players or participants, in such a way that only certain specified subsets of players are able to reconstruct the secret while smaller s...

Secret Sharing Schemes Based on Room Squares

In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets